Longest Repeats with a Block of Don't Cares
نویسندگان
چکیده
A k-repeat is a stringwk=u∗ kv that matches more than one substring of x, where ∗ is the don’t care letter and k > 0.We propose an O(n log n)-time algorithm for computing all longest k-repeats in a given string x = x[1..n]. The proposed algorithm uses suffix trees to fulfill this task and relies on the ability to answer lowest common ancestor queries in constant time. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
On pattern matching with k mismatches and few don't cares
We consider the problem of pattern matching with k mismatches, where there can be don't care or wild card characters in the pattern. Specifically, given a pattern P of length m and a text T of length n, we want to find all occurrences of P in T that have no more than k mismatches. The pattern can have don't care characters, which match any character. Without don't cares, the best known algorith...
متن کاملApproximate String Matching with Variable Length Don ' t Care
Searching for DNA or amino acid sequences similar to a given pattern string is very important in molecular biology. In fact, a lot of programs and algorithms have been developed. Most of them are based on alignment of strings or approximate string matching. However, they do not seem to be adequate in some cases. For example, the DNA pattern TATA (known as TATA box) is a common promoter that oft...
متن کاملDon't cares in synthesis: theoretical pitfalls and practical solutions
E ective use of don't cares requires solving several theoretical and practical problems. The theoretical problems are caused by a need to have all tools in a methodology use a consistent semantics of don't cares, so as to guarantee correctness of the nal implementation. Several common meanings of \don't care" will be considered and their respective conditions for design correctness will be deri...
متن کاملSelf-normalised Distance with Don't Cares
Self-normalised distance with don't cares Slide 1
متن کاملA Filtering Algorithm for k -Mismatch with Don't Cares
We present a filtering based algorithm for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols in either p or t (but not both), and a bound k, our algorithm finds all the places that the pattern matches the text with at most k mismatches. The algorithm is deterministic and runs in Θ(nmk logm) time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004